Article 3317

Title of the article

A METHOD TO CONSTRUCT COLOURED PETRI NETS THAT SIMULATE DIGITAL AUTOMATON’S PERFORMANCE 

Authors

Kizilov Evgeniy Aleksandrovich, Applicant, Penza State University (40 Krasnaya street, Penza, Russia), jk6001@yandex.ru

Index UDK

681.31

DOI

10.21685/2072-3059-2017-3-3

Abstract

Background. The aim of the work is to develop a methodology that allows to build a coloured Petri net that simulates the functioning of technical processes or objects according to their initial automatic description.
Materials and methods. The formal description of the Petri net simulating the given digital automaton consists in finding correspondence between a set of states and signals describing the digital automaton and a set of positions, transitions and markings describing the coloured Petri net.
Results. The work proposes a step-by-step template for constructing the Petri net and gives examples of the Petri net synthesis based on their initial description in the language of canonical equation systems.
Conclusions. The article proposes the technique for coloured Petri net construction, which provides adequate simulation of the abstract digital automaton’s performance.

Key words

coloured Petri net, abstract digital automaton, Mealy automaton, Moore automaton

Download PDF
References

1. Kotov V. E. Seti Petri [Petri nets]. Moscow: Nauka, 1984, 161 p.
2. Piterson Dzh. Teoriya setey Petri i modelirovanie sistem: per. s angl. [The theory of petri nets and system simulation: translation from English]. Moscow: Mir, 1984, 264 p.
3. Jensen K. Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use. New York: Springer-Verlag, 1992, 234 p.
4. Zaytsev D. A., Shmeleva T. R. Modelirovanie telekommunikatsionnykh sistem v CPN Tools [Telecommunication system simulation via CPN Tools]. Odessa: ONAT, 2006, 68 p.
5. Mekhanov V. B. Telematika-2010: tr. XVII Vseros. nauch.-metod. konf. [Telematics-2010: proceedings of XVII All-Russian scientific and methodological conference]. Saint-Petersburg: SPbGU ITMO, 2010, vol. 2, pp. 283–284.
6. Mekhanov V. B., Kizilov E. A., Konnov N. N. Telematika-2010: tr. XVIII Vseros. nauch.-metod. konf. [Telematics-2010: proceedings of XVII All-Russian scientific and methodological conference]. Saint-Petersburg: SPbGU ITMO, 2011, vol. 1, pp. 238–240.
7. Hopcroft J. E., Motwani R., Ullman J. D. Introduction to Automata Theory, Languages, and Computation. Moscow: Vil'yams, 2002, 528 p.
8. Vashkevich N. P., Biktashev R. A. Izvestiya vysshikh uchebnykh zavedeniy. Povolzhskiy region. Tekhnicheskie nauki [University proceedings. Volga region. Engineering sciences]. 2011, no. 1 (17), pp. 3–11.
9. Vashkevich N. P., Biktashev R. A. Nedeterminirovannye avtomaty i ikh ispol'zovanie dlya realizatsii sistem parallel'noy obrabotki informatsii: monografiya [Stochastic automata and their application in data parallel processing systems: monograph]. Penza: Idvo
PGU, 2016, 394 p.
10. Jensen K., Kristensen L. M. Coloured Petri Nets: modelling and validation of concurrent systems. New York: Springer, 2009, 382p.
11. Zakharov N. G., Rogov V. N. Sintez tsifrovykh avtomatov: ucheb. posobie [Digital automata synthesis: teaching aid]. Ulyanovsk: UlGTU, 2003, 136 p.

 

Дата создания: 06.02.2018 10:34
Дата обновления: 26.02.2018 14:59